/*
	This file is part of AVRCppLib.

    AVRCppLib is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    AVRCppLib is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with AVRCppLib.  If not, see <http://www.gnu.org/licenses/>.

    Copyright (C) Maxime Lemonnier 2007-2011
 */

#ifndef LINKEDLIST_ITERATOR_H_
#define LINKEDLIST_ITERATOR_H_

#include "../Utils/CppExtensions.h"
#include "../Utils/BitManipulation.h"
#include "Iterator.h"
#include "Node.h"

template <class ElementType>
class LinkedListIterator : public Iterator<ElementType> {

public :
	bool hasNext()
	{
		return !isNull(currentNode->next);
	}

	bool hasPrevious()
	{
		return !isNull(currentNode->previous);
	}

	ElementType * current()
	{
		if(isNull(currentNode))
			return NULL;
		return &(currentNode->el);
	}

	ElementType * next()
	{
		if(!isNull(currentNode))
			currentNode = currentNode->next;

		return current();
	}

	ElementType * previous()
	{
		if(!isNull(currentNode))
			currentNode = currentNode->previous;

		return current();
	}

	LinkedListIterator(Node<ElementType> * begin) : currentNode(begin)
	{

	}

private: //TODO put back private

	Node<ElementType> * currentNode;
};
#endif /* LINKEDLIST_ITERATOR_H_ */
